Fuzzy Automata based on Lattice-Ordered Monoid and Associated Topology∗
نویسندگان
چکیده
The concepts of fuzzy source and fuzzy successor operators for an L-fuzzy automaton (L is a latticeordered monoid) are introduced, which turn out to be L-fuzzy closure operators. When L is a quantale, these operators introduce L-fuzzy topologies. These observations are then used to give topological characterization of the separatedness and connectedness properties of an L-fuzzy automaton. c ©2012 World Academic Press, UK. All rights reserved.
منابع مشابه
FUZZY PREORDERED SET, FUZZY TOPOLOGY AND FUZZY AUTOMATON BASED ON GENERALIZED RESIDUATED LATTICE
This work is towards the study of the relationship between fuzzy preordered sets and Alexandrov (left/right) fuzzy topologies based on generalized residuated lattices here the fuzzy sets are equipped with generalized residuated lattice in which the commutative property doesn't hold. Further, the obtained results are used in the study of fuzzy automata theory.
متن کاملMyhill-Nerode Fuzzy Congruences Corresponding to a General Fuzzy Automata
Myhill-Nerode Theorem is regarded as a basic theorem in the theories of languages and automata and is used to prove the equivalence between automata and their languages. The significance of this theorem has stimulated researchers to develop that on different automata thus leading to optimizing computational models. In this article, we aim at developing the concept of congruence in general fuzzy...
متن کاملQuantale-valued fuzzy Scott topology
The aim of this paper is to extend the truth value table oflattice-valued convergence spaces to a more general case andthen to use it to introduce and study the quantale-valued fuzzy Scotttopology in fuzzy domain theory. Let $(L,*,varepsilon)$ be acommutative unital quantale and let $otimes$ be a binary operationon $L$ which is distributive over nonempty subsets. The quadruple$(L,*,otimes,varep...
متن کاملGENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...
متن کاملConstruction of fuzzy automata from fuzzy regular expressions
Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68–92] have proved fundamental results that provide different equivalentways to represent fuzzy languageswithmembership values in a lattice-orderedmonoid, and generalize the well-known results of the classical theory of fo...
متن کامل